Automated Derivation of Translators From Annotated Grammars

نویسندگان

  • Diego Ordóñez Camacho
  • Kim Mens
  • Mark van den Brand
  • Jurgen J. Vinju
چکیده

In this paper we propose a technique to automate the process of building translators between operations languages, a family of DSLs used to program satellite operations procedures. We exploit the similarities between those languages to semiautomatically build a transformation schema between them, through the use of annotated grammars. To improve the overall translation process even more, reducing its complexity, we also propose an intermediate representation common to all operations languages. We validate our approach by semi-automatically deriving translators between some operations languages, using a prototype tool which we implemented for that purpose.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated generation of program translation and verification tools using annotated grammars

Automatically generating program translators from source and target language specifications is a non-trivial problem. In this paperwe focus on the problem of automating the process of building translators between operations languages, a family of DSLs used to program satellite operations procedures. We exploit their similarities to semi-automatically build transformation tools between these DSL...

متن کامل

Lost in Grammar Translation Lost in Grammar Translation

1http://www.di.unito.it/∼tutreeb/ Italian Treebank2 (VIT), and the ISST3. None of them is comparable in size with the English Penn Treebank. This limits the possibility to have reliable induced grammars for Italian. Initial studies have shown that probabilistic grammars induced on a small corpus have not impressive performances [5]. Building larger corpora is then needed. We have been working o...

متن کامل

Smart Computer Aided Translation Environment - SCATE

We aim at improving the translators' efficiency through five different scientific objectives. Concerning improvements in translation technology, we are investigating syntax-based fuzzy matching in which we estimate similarity based on syntactic edit distance or similar measures. We are working on syntax-based MT using synchronous tree substitution grammars induced from parallel node-aligned tre...

متن کامل

Things between Lexicon and Grammar

A number of grammar formalisms were proposed in 80’s, such as Lexical Functional Grammars, Generalized Phrase Structure Grammars, and Tree Adjoining Grammars. Those formalisms then started to put a stress on lexicon, and were called as lexicalist (or lexicalized) grammars. Representative examples of lexicalist grammars were Head-driven Phrase Structure Grammars (HPSG) and Lexicalized Tree Adjoi...

متن کامل

A Large-Scale Japanese CFG Derived from a Syntactically Annotated Corpus and Its Evaluation

Although large-scale grammars are prerequisite for parsing a great variety of sentences, it is difficult to build such grammars by hand. Yet, it is possible to build a context-free grammar (CFG) by deriving it from a syntactically annotated corpus. Many such corpora have been built recently to obtain statistical information concerning corpus-based NLP technologies. For English, it is well known...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 164  شماره 

صفحات  -

تاریخ انتشار 2006